منابع مشابه
Eigenvalue comparisons in graph theory
In this paper, we explore what happens when the same techniques are applied to the problem of estimating eigenvalues of the adjacency operator on finite graphs of bounded degree. In Theorem 7, we show how eigenvalues of the adjacency operator on a finite graph Γ may be bounded in terms of the biggest eigenvalues of the adjacency operator on “geodesic balls” in Γ. We find explicit bounds for the...
متن کاملSpectral graph theory and the inverse eigenvalue problem of a graph
Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...
متن کاملEla Spectral Graph Theory and the Inverse Eigenvalue Problem of a Graph∗
Spectral Graph Theory is the study of the spectra of certain matrices defined from a given graph, including the adjacency matrix, the Laplacian matrix and other related matrices. Graph spectra have been studied extensively for more than fifty years. In the last fifteen years, interest has developed in the study of generalized Laplacian matrices of a graph, that is, real symmetric matrices with ...
متن کاملThe Eigenvalue Problem: Perturbation Theory The Unsymmetric Eigenvalue Problem
The Unsymmetric Eigenvalue Problem Just as the problem of solving a system of linear equations Ax = b can be sensitive to perturbations in the data, the problem of computing the eigenvalues of a matrix can also be sensitive to perturbations in the matrix. We will now obtain some results concerning the extent of this sensitivity. Suppose that A is obtained by perturbing a diagonal matrix D by a ...
متن کاملPerturbation Theory for HomogeneousPolynomial Eigenvalue
We consider polynomial eigenvalue problems P(A; ;)x = 0 in which the matrix polynomial is homogeneous in the eigenvalue (;) 2 C 2. In this framework innnite eigenvalues are on the same footing as nite eigenvalues. We view the problem in projective spaces to avoid normalization of the eigenpairs. We show that a polynomial eigenvalue problem is well-posed when its eigenvalues are simple. We deene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pacific Journal of Mathematics
سال: 1996
ISSN: 0030-8730,0030-8730
DOI: 10.2140/pjm.1996.176.443